A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization

Hybridization of genetic algorithms with local search approaches can enhance their performance in global optimization. Genetic algorithms, as most population based algorithms, require a considerable number of function evaluations. This may be an important drawback when the functions involved in the problem are computationally expensive as it occurs in most real world problems. Thus, in order to reduce the total number of function evaluations, local and global techniques may be combined. Moreover, the hybridization may provide a more effective trade-off between exploitation and exploration of the search space. In this study, we propose a new hybrid genetic algorithm based on a local pattern search that relies on an augmented Lagrangian function for constraint-handling. The local search strategy is used to improve the best approximation found by the genetic algorithm. Convergence to an εglobal minimizer is proved. Numerical results and comparisons with other stochastic algorithms using a set of benchmark constrained problems are provided.